That strange number ‘zero’
نویسندگان
چکیده
منابع مشابه
Proving in Zero - Knowledge that a Number
We present the rst eecient statistical zero-knowledge protocols to prove statements such as: { A committed number is a prime. { A committed (or revealed) number is the product of two safe primes, i.e., primes p and q such that (p ? 1)=2 and (q ? 1)=2 are prime. { A given integer has large multiplicative order modulo a composite number that consists of two safe prime factors. The main building b...
متن کاملThat Strange Procedure Called Quantisation
This is a pedagogical and (almost) self-contained introduction into the Theorem of Groenewold and van Howe, which states that a naive transcription of Dirac’s quantisation rules cannot work. Some related issues in quantisation theory are also discussed. First-class constrained systems a briefly described in a slightly more ‘global’ fashion.1
متن کاملOn the zero forcing number of some Cayley graphs
Let Γa be a graph whose each vertex is colored either white or black. If u is a black vertex of Γ such that exactly one neighbor v of u is white, then u changes the color of v to black. A zero forcing set for a Γ graph is a subset of vertices Zsubseteq V(Γ) such that if initially the vertices in Z are colored black and the remaining vertices are colored white, then Z changes the col...
متن کاملZero forcing number of graphs
A subset S of initially infected vertices of a graph G is called forcing if we can infect the entire graph by iteratively applying the following process. At each step, any infected vertex which has a unique uninfected neighbour, infects this neighbour. The forcing number of G is the minimum cardinality of a forcing set in G. In the present paper, we study the forcing number of various classes o...
متن کاملProving in Zero-Knowledge that a Number Is the Product of Two Safe Primes
This paper presents the first efficient statistical zero-knowledge protocols to prove statements such as: A committed number is a pseudo-prime. A committed (or revealed) number is the product of two safe primes, i.e., primes p and q such that (p1)=2 and (q 1)=2 are primes as well. A given value is of large order modulo a composite number that consists of two safe prime factors. So far, nomethod...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Policy and Practice in Health and Safety
سال: 2017
ISSN: 1477-3996,1477-4003
DOI: 10.1080/14773996.2017.1376404